翻訳と辞書 Words near each other ・ Erechthias minuscula ・ Erechthias molynta ・ Erechthias mystacinella ・ Erdős–Kac theorem ・ Erdős–Ko–Rado theorem ・ Erdős–Mordell inequality ・ Erdős–Nagy theorem ・ Erdős–Nicolas number ・ Erdős–Pósa theorem ・ Erdős–Rado theorem ・ Erdős–Rényi model ・ Erdős–Stone theorem ・ Erdős–Straus conjecture ・ Erdős–Szekeres theorem ・ Erdős–Szemerédi theorem ・ Erdős–Turán conjecture on additive bases ・ Erdős–Turán inequality ・ Erdős–Woods number ・ Erdőtarcsa ・ ERE ・ ERE Informatique ・ Ere Kokkonen ・ Ere language ・ Ere. Elamvazhuthi ・ Ereal ・ ERealty ・ Erean Mountains ・ Erebabraxas ・ Erebango ・ Erebato River Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Erdős–Turán conjecture on additive bases ： ウィキペディア英語版 Erdős–Turán conjecture on additive bases The Erdős–Turán conjecture is an old unsolved problem in additive number theory (not to be confused with Erdős conjecture on arithmetic progressions) posed by Paul Erdős and Pál Turán in 1941. The question concerns subsets of the natural numbers, typically denoted by $\backslash mathbb$, called ''additive bases''. A subset $B$ is called an (asymptotic) additive basis of finite order if there is some positive integer $h$ such that every sufficiently large positive integer $n$ can be written as the sum of at most $h$ elements of $B$. For example, the natural numbers are themselves an additive basis of order 1, since every natural number is trivially a sum of at most one natural number. It is a non-trivial theorem of Lagrange (Lagrange's four-square theorem) that the set of positive square numbers is an additive basis of order 4. Another highly non-trivial and celebrated result along these lines is Vinogradov's theorem. One is naturally inclined to ask how optimal are these results. It turns out that Lagrange's four-square theorem cannot be improved, as there are infinitely many positive integers which are not the sum of three squares. This is because that no positive integer which is the sum of three squares can leave a remainder of 7 when divided by 8. However, one should perhaps expect that a set $B$ which is about as sparse as the squares (meaning that in a given interval $()$, roughly $N^$ of the integers in $()$ lie in $B$) which does not have this obvious deficit should have the property that every sufficiently large positive integer is the sum of three elements from $B$. This follows from the following probabilistic model: suppose that is a positive integer, and $x\_1,\; x\_2,\; x\_3$ are 'randomly' selected from $B\; \backslash cap\; ()$. Then the probability of a given element from $B$ being chosen is roughly $1/N^$. One can then estimate the expected value, which in this case will be quite large. Thus, we `expect' that there are many representations of $n$ as a sum of three elements from $B$, unless there is some arithmetic obstruction (which means that $B$ is somehow quite different than a `typical' set of the same density), like with the squares. Therefore, one should expect that the squares are quite inefficient at representing positive integers as the sum of four elements, since there should already be lots of representations as sums of three elements for those positive integers $n$ that passed the arithmetic obstruction. Examining Vinogradov's theorem quickly reveals that the primes are also very inefficient at representing positive integers as the sum of four primes, for instance. This begets the question: suppose that $B$, unlike the squares or the prime numbers, is very efficient at representing positive integers as a sum of $h$ elements of $B$. How efficient can it be? The best possibility is that we can find a positive integer $h$ and a set $B$ such that every positive integer $n$ is the sum of at most $h$ elements of $B$ in exactly one way. Failing that, perhaps we can find a $B$ such that every positive integer $n$ is the sum of at most $h$ elements of $B$ in at least one way and at most $S(h)$ ways, where $S$ is a function of $h$. This is basically the question that Paul Erdős and Pál Turán asked in 1941. Indeed, they conjectured a ''negative'' answer to this question, namely that if $B$ is an additive basis of order $h$ of the natural numbers, then it cannot represent positive integers as a sum of at most $h$ too efficiently; the number of representations of $n$, as a function of $n$, must tend to infinity. ==History== The conjecture was made jointly by Paul Erdős and Pál Turán in. In the original paper, they state "(2) If $f(n)\; >\; 0$ for $n\; >\; n\_0$, then $\backslash varlimsup\_\; f(n)\; =\; \backslash infty$" Here $f(n)$ is the number of ways one can write the natural number $n$ as the sum of two (not necessarily distinct) elements of $B$. If $f(n)$ is always positive for sufficiently large $n$, then $B$ is called an additive basis (of order 2). This problem has attracted significant attention〔 but remains unsolved. In 1964, Erdős published a multiplicative version of this conjecture. See source : *P. Erdõs: On the multiplicative representation of integers, Israel J. Math. 2 (1964), 251--261 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Erdős–Turán conjecture on additive bases」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.